K.Khadiev WIDTH HIERARCHY FOR K-OBDD OF SMALL WIDTH
نویسنده
چکیده
In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (ISA) functions.
منابع مشابه
Width Hierarchy for k-OBDD of Small Width
In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...
متن کاملExponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies
In this paper, we study quantum OBDD model, it is a restricted version of read-once quantum branching programs, with respect to “width” complexity. It is known that the maximal gap between deterministic and quantum complexities is exponential. But there are few examples of functions with such a gap. We present a method (called “reordering”), which allows us to transform a Boolean function f int...
متن کاملReordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to “width” complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called “reordering”), which allows to build Boolean function g from Boolean Function f , such that if ...
متن کاملVery Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
We present several results on comparative complexity for different variants of OBDD models. – We present some results on comparative complexity of classical and quantum OBDDs. We consider a partial function depending on parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2 but any classical OBDD (deterministic or stable bounded error probabilistic) ne...
متن کاملWidth Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test
We consider quantum, nondterministic and probabilistic versions of known computational model Ordered Read-k-times Branching Programs or Ordered Binary Decision Diagrams with repeated test (kQOBDD, k-NOBDD and k-POBDD). We show width hierarchy for complexity classes of Boolean function computed by these models and discuss relation between different variants of k-OBDD.
متن کامل